Achievability Proof via Output Statistics of Random Binning
نویسندگان
چکیده
منابع مشابه
On Achievability via Random Binning
In [1], the authors present a novel tool to establish achievability results in network information theoretic problems. The main idea is to study a set of discrete memoryless correlated sources, and the ensuing statistics of the bin indices resulting from random binning of the sources. Sufficient conditions are established on rates of random binning such that these indices are mutually independe...
متن کاملExperiments in Binning Image Statistics
Various vision tasks require the computation of image statistics and aggregating them into histograms. These histograms are usually compared using the χ distance which gives a rough idea of the similarity of the two image patches. For example, in [2] a histogram of key-points is collected on a rectangular grid for the category recognition task. Other researchers, [3], have used local image stat...
متن کاملMotion Picture Watermarking Via Quantization of Pseudo-Random Linear Statistics
In this paper, we propose a semi-blind video watermarking scheme, where we use pseudo-random robust semiglobal features of video in the spatially wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. We use a novel approach in generating t...
متن کاملA General Framework for Estimating Graphlet Statistics via Random Walk
Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social networks (OSNs) and biological networks. Discovering and computing graphlet statistics are highly challenging. First, the massive size of real-world graphs makes the exact computation of graphlets extremely expensive. Second...
متن کاملApproximation theory of output statistics
Given a channel and an input process we study the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy. We introduce the notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2351812